Random Motion on Simple Graphs: Addendum
نویسندگان
چکیده
منابع مشابه
Addendum to "trees in random graphs"
The aim of this addendum is to explain more precisely the second part of the proof of Theorem 1 from our paper [1] . We need to show that a.e. graph G E lfi(n, p) contains a maximal induced tree of order less than (1+6)x (log n)/(log d) . The second moment method used in our Lemma shows in fact that Prob{0 .9 E(X,) < X, < 1 .1 E(X,)} = 1-o(1) . (1') Now let S, stand for the number of (1, r)-sta...
متن کاملSimple random walks on wheel graphs
A simple random walk on a graph is defined in which a particle moves from one vertex to any adjacent vertex, each with equal probability. The expected hitting time is the expected number of steps to get from one vertex to another before returning to the starting vertex. In this paper, using the electrical network approach, we provide explicit formulae for expected hitting times for simple rando...
متن کاملSimple Random Walks on Radio Networks (Simple Random Walks on Hyper-Graphs)
In recent years, protocols that are based on the properties of random walks on graphs have found many applications in communication and information networks, such as wireless networks, peer-to-peer networks and the Web. For wireless networks (and other networks), graphs are actually not the correct model of the communication; instead hyper-graphs better capture the communication over a wireless...
متن کاملAddendum to “random Walk on Random Groups” by M. Gromov
Written at the request of GAFA’s Editorial Board, with the goal of explicating some aspects of M. Gromov’s paper [2]. Section 1 recalls the construction of the random group, while section 2 contains a proof that the random group has property (T) based on the ideas from the preprint. The appendix defines CAT(0) spaces and works out in detail some geometric propositions from the preprint used in ...
متن کاملRandom Walks on Random Graphs
The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs. Given a graphG = (V,E), let dG(v) denote the degree of vertex v for all...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Methodology and Computing in Applied Probability
سال: 2012
ISSN: 1387-5841,1573-7713
DOI: 10.1007/s11009-012-9298-3